TSTP Solution File: SET605^5 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : SET605^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n009.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sat May  4 09:19:31 EDT 2024

% Result   : Theorem 0.21s 0.53s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   12 (   5 unt;   4 typ;   0 def)
%            Number of atoms       :   20 (   1 equ;   0 cnn)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :   47 (  15   ~;  10   |;   5   &;  16   @)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    6 (   6   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   3 usr;   3 con; 0-2 aty)
%            Number of variables   :    7 (   2   ^   5   !;   0   ?;   7   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_sort1,type,
    a: $tType ).

thf(decl_22,type,
    epred1_0: a > $o ).

thf(decl_23,type,
    epred2_0: a > $o ).

thf(decl_24,type,
    esk1_0: a ).

thf(cBOOL_PROP_76_pme,conjecture,
    ! [X1: a > $o,X2: a > $o] :
      ( ( ^ [X3: a] :
            ( ( X1 @ X3 )
            & ~ ( ( X1 @ X3 )
                | ( X2 @ X3 ) ) ) )
      = ( ^ [X3: a] : ~ $true ) ),
    file('/export/starexec/sandbox2/tmp/tmp.IQU8rsHrIz/E---3.1_31483.p',cBOOL_PROP_76_pme) ).

thf(c_0_1,negated_conjecture,
    ~ ! [X1: a > $o,X2: a > $o,X6: a] :
        ( ( ( X1 @ X6 )
          & ~ ( ( X1 @ X6 )
              | ( X2 @ X6 ) ) )
      <=> ~ $true ),
    inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cBOOL_PROP_76_pme])])]) ).

thf(c_0_2,negated_conjecture,
    ( ( ~ ( epred1_0 @ esk1_0 )
      | ( epred1_0 @ esk1_0 )
      | ( epred2_0 @ esk1_0 )
      | $true )
    & ( ( epred1_0 @ esk1_0 )
      | ~ $true )
    & ( ~ ( epred1_0 @ esk1_0 )
      | ~ $true )
    & ( ~ ( epred2_0 @ esk1_0 )
      | ~ $true ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).

thf(c_0_3,negated_conjecture,
    ( ~ ( epred1_0 @ esk1_0 )
    | ~ $true ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    ( ( epred1_0 @ esk1_0 )
    | ~ $true ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_5,negated_conjecture,
    ~ ( epred1_0 @ esk1_0 ),
    inference(cn,[status(thm)],[c_0_3]) ).

thf(c_0_6,negated_conjecture,
    epred1_0 @ esk1_0,
    inference(cn,[status(thm)],[c_0_4]) ).

thf(c_0_7,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.15  % Problem    : SET605^5 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.16  % Command    : run_E %s %d THM
% 0.14/0.37  % Computer : n009.cluster.edu
% 0.14/0.37  % Model    : x86_64 x86_64
% 0.14/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37  % Memory   : 8042.1875MB
% 0.14/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37  % CPULimit   : 300
% 0.14/0.37  % WCLimit    : 300
% 0.14/0.37  % DateTime   : Fri May  3 10:03:55 EDT 2024
% 0.14/0.37  % CPUTime    : 
% 0.21/0.52  Running higher-order theorem proving
% 0.21/0.52  Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.IQU8rsHrIz/E---3.1_31483.p
% 0.21/0.53  # Version: 3.1.0-ho
% 0.21/0.53  # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.21/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53  # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.21/0.53  # Starting post_as_ho10 with 300s (1) cores
% 0.21/0.53  # Starting new_bool_9 with 300s (1) cores
% 0.21/0.53  # Starting sh5l with 300s (1) cores
% 0.21/0.53  # post_as_ho10 with pid 31625 completed with status 0
% 0.21/0.53  # Result found by post_as_ho10
% 0.21/0.53  # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.21/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53  # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.21/0.53  # Starting post_as_ho10 with 300s (1) cores
% 0.21/0.53  # No SInE strategy applied
% 0.21/0.53  # Search class: HUUNF-FFSF00-SSSFFFNN
% 0.21/0.53  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53  # Starting new_ho_10 with 163s (1) cores
% 0.21/0.53  # new_ho_10 with pid 31632 completed with status 0
% 0.21/0.53  # Result found by new_ho_10
% 0.21/0.53  # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.21/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53  # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.21/0.53  # Starting post_as_ho10 with 300s (1) cores
% 0.21/0.53  # No SInE strategy applied
% 0.21/0.53  # Search class: HUUNF-FFSF00-SSSFFFNN
% 0.21/0.53  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53  # Starting new_ho_10 with 163s (1) cores
% 0.21/0.53  # Preprocessing time       : 0.001 s
% 0.21/0.53  # Presaturation interreduction done
% 0.21/0.53  
% 0.21/0.53  # Proof found!
% 0.21/0.53  # SZS status Theorem
% 0.21/0.53  # SZS output start CNFRefutation
% See solution above
% 0.21/0.53  # Parsed axioms                        : 2
% 0.21/0.53  # Removed by relevancy pruning/SinE    : 0
% 0.21/0.53  # Initial clauses                      : 5
% 0.21/0.53  # Removed in clause preprocessing      : 2
% 0.21/0.53  # Initial clauses in saturation        : 3
% 0.21/0.53  # Processed clauses                    : 2
% 0.21/0.53  # ...of these trivial                  : 0
% 0.21/0.53  # ...subsumed                          : 0
% 0.21/0.53  # ...remaining for further processing  : 1
% 0.21/0.53  # Other redundant clauses eliminated   : 0
% 0.21/0.53  # Clauses deleted for lack of memory   : 0
% 0.21/0.53  # Backward-subsumed                    : 0
% 0.21/0.53  # Backward-rewritten                   : 0
% 0.21/0.53  # Generated clauses                    : 0
% 0.21/0.53  # ...of the previous two non-redundant : 0
% 0.21/0.53  # ...aggressively subsumed             : 0
% 0.21/0.53  # Contextual simplify-reflections      : 0
% 0.21/0.53  # Paramodulations                      : 0
% 0.21/0.53  # Factorizations                       : 0
% 0.21/0.53  # NegExts                              : 0
% 0.21/0.53  # Equation resolutions                 : 0
% 0.21/0.53  # Disequality decompositions           : 0
% 0.21/0.53  # Total rewrite steps                  : 1
% 0.21/0.53  # ...of those cached                   : 0
% 0.21/0.53  # Propositional unsat checks           : 0
% 0.21/0.53  #    Propositional check models        : 0
% 0.21/0.53  #    Propositional check unsatisfiable : 0
% 0.21/0.53  #    Propositional clauses             : 0
% 0.21/0.53  #    Propositional clauses after purity: 0
% 0.21/0.53  #    Propositional unsat core size     : 0
% 0.21/0.53  #    Propositional preprocessing time  : 0.000
% 0.21/0.53  #    Propositional encoding time       : 0.000
% 0.21/0.53  #    Propositional solver time         : 0.000
% 0.21/0.53  #    Success case prop preproc time    : 0.000
% 0.21/0.53  #    Success case prop encoding time   : 0.000
% 0.21/0.53  #    Success case prop solver time     : 0.000
% 0.21/0.53  # Current number of processed clauses  : 1
% 0.21/0.53  #    Positive orientable unit clauses  : 1
% 0.21/0.53  #    Positive unorientable unit clauses: 0
% 0.21/0.53  #    Negative unit clauses             : 0
% 0.21/0.53  #    Non-unit-clauses                  : 0
% 0.21/0.53  # Current number of unprocessed clauses: 1
% 0.21/0.53  # ...number of literals in the above   : 1
% 0.21/0.53  # Current number of archived formulas  : 0
% 0.21/0.53  # Current number of archived clauses   : 0
% 0.21/0.53  # Clause-clause subsumption calls (NU) : 0
% 0.21/0.53  # Rec. Clause-clause subsumption calls : 0
% 0.21/0.53  # Non-unit clause-clause subsumptions  : 0
% 0.21/0.53  # Unit Clause-clause subsumption calls : 0
% 0.21/0.53  # Rewrite failures with RHS unbound    : 0
% 0.21/0.53  # BW rewrite match attempts            : 0
% 0.21/0.53  # BW rewrite match successes           : 0
% 0.21/0.53  # Condensation attempts                : 2
% 0.21/0.53  # Condensation successes               : 0
% 0.21/0.53  # Termbank termtop insertions          : 335
% 0.21/0.53  # Search garbage collected termcells   : 126
% 0.21/0.53  
% 0.21/0.53  # -------------------------------------------------
% 0.21/0.53  # User time                : 0.003 s
% 0.21/0.53  # System time              : 0.001 s
% 0.21/0.53  # Total time               : 0.004 s
% 0.21/0.53  # Maximum resident set size: 1760 pages
% 0.21/0.53  
% 0.21/0.53  # -------------------------------------------------
% 0.21/0.53  # User time                : 0.006 s
% 0.21/0.53  # System time              : 0.001 s
% 0.21/0.53  # Total time               : 0.007 s
% 0.21/0.53  # Maximum resident set size: 1716 pages
% 0.21/0.53  % E---3.1 exiting
% 0.21/0.53  % E exiting
%------------------------------------------------------------------------------